Internally deterministic parallel algorithms can be fast
نویسندگان
چکیده
منابع مشابه
Fast Parallel Deterministic and Randomized Algorithms for Model Checking
Model checking is a powerful technique for verification of concurrent systems. One of the potential problems with this technique is state space explosion. There are two ways in which one could cope with state explosion: reducing the search space and searching less space. Most of the existing algorithms are based on the first approach. One of the successful approach for reducing search space use...
متن کاملFast Parallel Permutation Algorithms
We investigate the problem of permuting n data items on an EREW PRAM with p processors using little additional storage We present a simple algorithm with run time O n p logn and an improved algorithm with run time O n p logn log log n p Both algorithms require n additional global bits and O local storage per processor If pre x summation is supported at the instruction level the run time of the ...
متن کاملParallel Programming Must Be Deterministic by Default
In today’s widely used parallel programming models, subtle programming errors can lead to unintended nondeterministic behavior and hard to catch bugs. In contrast, we argue for a parallel programming model that is deterministic by default: deterministic behavior is guaranteed unless the programmer explicitly uses nondeterministic constructs. This goal is particularly challenging for modern obje...
متن کاملFast Deterministic Parallel Branch-and-Bound
The branch-and-bound problem involves determining the minimum cost leaf in a cost-labelled tree, subject to the constraint that only the root is known initially and that children are revealed only by visiting their parent. We present the rst eecient deterministic algorithm to solve the branch-and-bound problem for a tree T of constant degree on a p-processor parallel machine. Let c be the cost ...
متن کاملFast deterministic sorting on large parallel machines
Many sorting algorithms that perform well on uniformly distributed data suffer significant performance degradation on non-random data. Unfortunately many real-world applications require sorting on data that is not uniformly distributed. In this paper, we consider distributions of varying entropies. We describe A-Ranksort, a new sorting algorithm for parallel machines, whose behavior on input di...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM SIGPLAN Notices
سال: 2012
ISSN: 0362-1340,1558-1160
DOI: 10.1145/2370036.2145840